Declarative and Operational Semantics for Bilattice-based Annotated Logic Programs
نویسندگان
چکیده
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. Thus, we discuss properties of the associated immediate consequence operators and establish their fixed-point theory. In addition, SLD-resolution for these programs is defined and its soundness and completeness established.
منابع مشابه
Sound and Complete SLD-Resolution for Bilattice-Based Annotated Logic Programs
We introduce the class of normal bilattice-based annotated first-order logic programs (BAPs) and develop declarative and operational semantics for them. In particular, SLD-resolution for these programs is defined and its soundness and completeness established.
متن کاملMany-valued Logic Programming and Fixpoint Semantics for Higher-order Herbrand Models
In this paper we compare the two versions of knowledge invariant transformations of the original Many-valued logic programs: the strict Annotated logic programs and the ’meta’ logic programs obtained by the ontological encapsulation [1]. We show that the first one has the higher-order Herbrand interpretations, while the last can be seen as the flattening of the first one. These two knowledge in...
متن کاملOn Approximation of the Semantic Operators Determined by Bilattice-Based Logic Programs
We introduce the class of bilattice-based annotated logic programs (BAPs). These programs extend the general annotated programs of Kifer and Subrahmanian to the bilattice case. The immediate consequence operator TP is defined for BAPs and its continuity is proven. A theorem of Seda concerning the approximation of the least fixed point of the two-valued TP -operator is generalized to the case of...
متن کاملA Declarative Agent Programming Language Based on Action Theories
We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between the specification of the agent’s strategic behavior and the underlying theory about the agent’s actions and their effects. This makes it a generic, declarative agent programming language, which can be combined with an...
متن کاملProgramming Towards a Roberto Barbuti ” , logical semantics for pure Prolog ’
The coincidence of the declarative and procedural interpretations of logic programs does not apply to Prolog programs, due to the depth-first left-to-right evaluation strategy of Prolog interpreters. We propose a semantics for Prolog programs based on a four-valued logic. The semantics is based on a new concept of completion analogous to Clark’s and it enjoys the nice properties of the declarat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006